An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
نویسندگان
چکیده
Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading Francesco Carrabs and Raffaele Cerulli Dipartimento di Matematica ed Informatica, Università di Salerno, 84084 Fisciano (SA), Italy [email protected], [email protected] Jean-François Cordeau Canada Research Chair in Logistics and Transportation and CIRRELT HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7 [email protected]
منابع مشابه
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be picked up, and a destination location where the load must be delivered. The problem consists of determining a shortest Hamiltonian cycle through all locations while ensuring that the pickup of each request is performed...
متن کاملA Branch-and-Bound Algorithm for the Double TSP with Two Stacks
This paper studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup and delivery of an item. All the pickup operations have to be performed before any delivery can take place. A single vehicle is available that starts from a depot, performs all the pickup operations and returns to the depot. Then, it performs...
متن کاملThe pickup and delivery traveling salesman problem with handling costs
This paper introduces the pickup and delivery traveling salesman problem with handling costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to destinations. Loading and unloading of the vehicle is operated in a last-in-firstout (LIFO) fashion. However, if a load must be unloaded that was not loaded last, additional handling operations are allowed to unload and rel...
متن کاملVariable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
Delivery Traveling Salesman Problem with LIFO Loading Francesco Carrabs Dipartimento di Matematica ed Informatica, Università di Salerno, 84084 Fisciano (SA), Italy [email protected] Jean-François Cordeau Canada Research Chair in Logistics and Transportation and Center for Research on Trasportation HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7 [email protected]...
متن کاملThe Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading
The feasible solutions of the traveling salesman problem with pickup and delivery (TSPPD) are represented by vertex lists in existing literature. However, when the TSPPD requires that the loading and unloading operations must be performed in a last-in-first-out (LIFO) manner, we show that its feasible solutions can be represented by trees. Consequently, we develop a variable neighbourhood searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFOR
دوره 45 شماره
صفحات -
تاریخ انتشار 2007